| contributor |
Danzart, Annie
|
| Charon, Irène
|
| Yvon, François
|
| Potier, Christine
|
| creator |
Hudry, Olivier
|
| date |
2005-12-06
|
| |
| description |
This course is an introduction to algorithmics and combinatorial optimisation. Different data base structures (stacks, trees, graphs) and basic algorithms will be introduced for standard problems (searches, hashing, sorting, Huffman encoding, tree covering the minimum weight, shortest paths, graphic paths, maximum value flows, colouring graphs). We will calculate the complexity of these algorithms and introduce the concept of the complexity of a problem. We will then evoke possible attitudes for facing optimization problems that are difficult to resolve: exact resolution: (using separation and evaluation tree methods) and approximate resolution (using heuristics). Among other things, we will demonstrate how to model certain problems to process them using the algorithms that were studied.
|
| This course is an introduction to algorithmics and combinatorial optimisation. Different data structures (stacks, trees, graphs) and basic algorithms will be introduced for standard problems (searches, hashing, sorting, Huffman encoding, trees covering the minimum weight, shortest paths, graphic paths, maximum value flows, colouring graphs). We will calculate the complexity of these algorithms and introduce the concept of the complexity of a problem. We will then evoke possible attitudes for facing optimization problems that are difficult to resolve: exact resolution: (using separation and evaluation tree methods) and approximate resolution (using heuristics). Among other things, we will demonstrate how to model certain problems to process them using the algorithms that were studied.
|
| Level: Licence 3ème année
|
| Level: Ingénieur 1ère année
|
| Course: Ingénieur
|
| Duration of the course: 28h00
|
| format |
text/html
|
| identifier |
ENST_INF101
|
| language |
en
|
| publisher |
Institut Télécom
|
| rights |
http://formation.enst.fr/licences/prive.html |